Iterative belief revision in extended logic programming
نویسندگان
چکیده
منابع مشابه
Iterative Belief Revision in Extended Logic Programming
Extended logic programming augments conventional logic programming with both default and explicit negation. Several semantics for extended logic programs have been proposed that extend the well-founded semantics for logic programs with default negation (called normal programs). We show that two of these extended semantics are intractable; both Dung's grounded argumentation semantics and the wel...
متن کاملIncorporating Specificity in Extended Logic Programs for Belief Revision
In this paper a new operator for agent’s implicit belief revision is presented. This operator is conceptually based on the following requirement: an agent should find first an explanation for the observations it makes before it tries to revise its beliefs. As a consequence, the proposed belief revision model does not agree with the principle of minimal change, commonly accepted. A translation o...
متن کاملBelief Revision in Non-Monotonic Reasoning and Logic Programming
In order to be able to explicitly reason about beliefs, we've introduced a non-monotonic formalism, called the Autoepistemic Logic of Beliefs, AEB, obtained by augmenting classical propositional logic with a belief operator, B. For this language we've deened the static autoepistemic expansions semantics. The resulting non-monotonic knowledge representation framework turned out to be rather simp...
متن کاملA simple modal logic for belief revision: Extended Abstract
The notions of static belief and of belief revision have been extensively studied in the literature. However, there is a surprising lack of uniformity in the two approaches. In the philosophy and logic literature the notion of static belief has been studied mainly within the context of modal logic. On the syntactic side a belief operator B is introduced, with the intended interpretation of B as...
متن کاملOntology Merging Using Belief Revision and Defeasible Logic Programming
We combine argumentation, belief revision and description logic ontologies for extending the δ-ontologies framework to show how to merge two ontologies in which the union of the strict terminologies could lead to inconsistency. To solve this problem, we revisit a procedure presented by Falappa et al. in which part of the offending terminologies are turned defeasible by using a kernel revision o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)80712-2